On the primal and dual constraint sets in geometric programming

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

Maximum Entropy and Primal-dual geometric programming approach in Multi-objective Vendor selection Problem

The objective of this paper is to analyze entropy based Vendor Selection Problem (VSP) model by using fuzzy mathematical programming and primal-dual geometric programming method. Here we have extended the unconstrained convex programming approach to solve VSP model with inequality constraints without adding artificial variables. By t-norm based fuzzy mathematical programming technique and the d...

Sets and Constraint Logi Programming

A Pseudo Primal - Dual Integer Programming Algorithm *

The Pseudo Primal-Dual Algorithm solves the pure integer programming problem in two stages, systematically violating and restoring dual feasibility while maintaining an all-integer matrix. The algorithm is related to Gomory AlI-fnteger Algorithm and the Young Primal Integer Programming Algorithm, differing from the former in the dual feasible stage by the choice of cuts and pivot variable, and ...

Primal-Dual Enumeration for Multiparametric Linear Programming

Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (pLPs) and solved explicitly offline. Several algorithms have recently been proposed in the literature that solve these pLPs in a fairly efficient manner, all of which have as a base operation the computation and removal of redundant constraints. For many problems, it is th...